Quantum arithmetics via computation with minimized external control: The half-adder
نویسندگان
چکیده
منابع مشابه
Quantum half-adder
Implementation of a linear optics quantum multibit half-adder that could show potential scalability is discussed. Parametric down-conversion sources are assumed that are pumped by a mode carrying orbital angular momentum l. A single photon from a pair is prepared by detection of its twin. This preparation of a single photon defines two bits to be summed and the starting carry control bit. This ...
متن کاملA novel logarithmic prefix adder with minimized power delay product
Parallel prefix addition is a technique for speeding up binary addition. Classical parallel prefix adder structures developed so far are optimized for logic depth, area, fan-out and interconnect count of logic circuits. Due to continuing integrating intensity and growing needs of portable devices, low-power and high-performance designs are of prime importance. A new technique, proposed for perf...
متن کاملQuantum Computation via Paraconsistent Computation
We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefly describe the standard models of quantum computation: quantum Turing machines and quantum circuits, and revise quantum algorithms to solve the so-called Deutsch’s problem and Deutsch-Jozsa problem. Then, we sh...
متن کاملDeoxyribozyme-based half-adder.
We have constructed a solution-phase array of three deoxyribozyme-based logic gates that behaves as a half-adder. Two deoxyribozymes mimic i(1)ANDNOTi(2) and i(2)ANDNOTi(1) gates that cleave a fluorogenic substrate, reporting through an increase in fluorescence emission at 570 nm. The third deoxyribozyme mimics an i(1)ANDi(2) gate and cleaves the other fluorogenic substrate, reporting through a...
متن کاملImproved Quantum Ternary Arithmetics
Qutrit (or ternary) structures arise naturally in many quantum systems, notably in certain non-abelian anyon systems. We present efficient circuits for ternary reversible and quantum arithmetics. Our main result is the derivation of circuits for two families of ternary quantum adders. The main distinction from the binary adders is a richer ternary carry which leads potentially to higher resourc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2018
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.97.062321